A fast fuzzy keyword spotting algorithm based on syllable confusion network
نویسندگان
چکیده
This paper presents a fast fuzzy search algorithm to extract keyword candidates from syllable confusion networks (SCNs) in Mandarin spontaneous speech. Since the recognition accuracy of spontaneous speech is quite poor, syllable confusion matrix (SCM) is applied to compensate for the recognition errors and to improve recall. For fast retrieval, an efficient vocabulary-independent index structure is designed, which selects individual arcs of syllable confusion network as indexing units. An inverted search algorithm that uses syllable confusion matrix to calculate relevance score and search in this index structure is proposed. In experiments performed on a telephone conversational task, the equal error rate (EER) was reduced by about 33% relative over the baseline where keywords are directly extracted from phoneme lattices. Additionally, it only took computer one or two seconds to search 100 keywords in one hour speech data.
منابع مشابه
Syllable Based Audio Search Using Confusion Network Arc as Indexing Unit
Compared to English, Chinese has a simpler and more restricted syllabic structure. In order to exploit the special characteristics of Chinese, syllable is selected as the unit for ASR lattice representation. For the sake of fast retrieval, syllable lattices are clustered into confusion network linear lattices, and then encoded into inverted index. To recover the posterior probabilities of prune...
متن کاملKeyword Spotting by Searching the Syllable Lattices
This paper presents a keyword spotting method based on searching a syllable lattice structure. The Mandarin syllables are represented in initial-final models. By one-stage dynamic programming, an utterance is converted into a sequence of topN-candidate syllables. It comes out a syllable lattice structure for this input utterance. A vocabulary of predefined keywords is represented as a set of sy...
متن کاملMulti-keyword spotting of telephone speech using a fuzzy search algorithm and keyword-driven two-level CBSM
In telephone speech recognition, the acoustic mismatch between training and testing environments often causes a severe degradation in the recognition performance. This paper presents a keyword-driven two-level codebook-based stochastic matching (CBSM) algorithm to eliminate the acoustic mismatch. Additionally, in Mandarin speech, it is dicult to correctly recognize the unvoiced part in a sylla...
متن کاملFast Approximate Matching Algorithm for Phone-based Keyword Spotting
Generally, exact matching is widely used for keyword spotting (KWS). Its performance depends heavily on the recognition accuracy. As for phone-based KWS system, the influence of phoneme error rate (PER) on KWS increases as the length of phoneme sequence for the keyword grows. Approximate matching is an alteration to compensate errors in recognition. Compared to exact matching, the calculation c...
متن کاملPerformance Evaluation of Non-Keyword Modeling for Vocabulary-Independent Keyword Spotting
In this paper, we develop a keyword spotting system using vocabulary-independent speech recognition technique, and investigate several non-keyword modeling methods to improve its performance. In order to overcome the weakness of conventional syllable model, we propose the syllable filler based on syllable information of keywords and syllable-like filler model. The former prohibits syllable fill...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007